Sphere Decoder for Massive MIMO
ثبت نشده
چکیده
Modern wireless communication systems demanding high data rate operating in bandwidth deficient world is using Multiple Input Multiple Output (MIMO) antenna arrangement. MIMO arrangement helping achieving high data rates with a technique of special multiplexing saves bandwidth but needs efficient receivers with manageable hardware. The receivers employing linear equalizers or Decision Feedback equalizers in detection use less hardware but are of suboptimum. Optimum detectors are realized by Maximum Likelihood Detectors but not suitable for implementation due to the complexity. Therefore suboptimum detectors such as Viterbi Decoding, Sphere Decoding and Genetic Algorithms based detectors are suitable candidates. Here we compare the performance of sphere decoder with some other detector. The complexity and SER rate of sphere decoder is good when compare with other detectors used in MIMO receiver design. The performance of sphere decoder and maximum likelihood decoder is same but complexity is reduced in sphere decoder. KeywordsComplexity, detector, MIMO system, SER, sphere decoder.
منابع مشابه
Staggered Sphere Decoding for MIMO detection
MIMO system is a key technology for future high speed wireless communication applications. At present MIMO systems are constrained by efficient detection algorithms/hardware architectures. In past much attention has been paid to either Sphere Decoder (Depth First Search), or K-best algorithm (breadth first search. Very little attention has been paid to architectures that combine these two appro...
متن کاملEfficient decoding algorithm using triangularity of $\mbf{R}$ matrix of QR-decomposition
An efficient decoding algorithm named ‘divided decoder’ is proposed in this paper. Divided decoding can be combined with any decoder using QR-decomposition and offers different pairs of performance and complexity. Divided decoding provides various combinations of two or more different searching algorithms. Hence it makes flexibility in error rate and complexity for the algorithms using it. We c...
متن کاملTwo Methods for Decreasing the Computational Complexity of the MIMO ML Decoder
We propose use of QR factorization with sort and Dijkstra’s algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signals on the multi-antenna fading channel. QR factorization with sort decreases the complexity of searching part of the decoder with small increase in the complexity required for preprocessing part of the decoder. Dijkstra’s a...
متن کاملNew Sphere Decoding Architecture for MIMO Systems
The sphere decoding algorithm (SDA) has been widely used for maximum likelihood (ML) detection in MIMO systems. However, the conventional SDA is very complex for hardware implementation, and the throughput of current SDA implementation is below the requirement of next generation high-speed wireless communications. In this paper, we introduce an efficient pipeline interleaved (PL) sphere decodin...
متن کاملOptimal Non-coherent Data Detection for Massive SIMO Wireless Systems with General Constellations: A Polynomial Complexity Solution
Massive MIMO systems can greatly increase spectral and energy efficiency over traditional MIMO systems by exploiting large antenna arrays. However, increasing the number of antennas at the base station (BS) makes the uplink noncoherent data detection very challenging in massive MIMO systems. In this paper we consider the joint maximum likelihood (ML) channel estimation and data detection proble...
متن کامل